package com.lihepeng.leecode.frequency.ArrayList;

/**
 * 二维数组的遍历查找
 *
 */
public class Solution18 {
    public boolean Find(int target, int [][] array) {

        return false;
    }
}
